Zero-error list capacities of discrete memoryless channels
نویسندگان
چکیده
منابع مشابه
Zero-error list capacities of discrete memoryless channels
We define zero-error list capacities for discrete memoryless channels. We find lower bounds to, and a characterization of these capacities. As is usual for such zero-error problems in information theory, the characterization is not generally a single-letter one. Nonetheless, we exhibit a class of channels for which a single letter characterization exists. We also show how the computational cuto...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملErasure, list, and detection zero-error capacities for low noise and a relation to identification
For the discrete memoryless channel (X ;Y;W ) we give characterisations of the zero{ error erasure capacity Cer and the zero{error average list size capacity Ca` in terms of limits of suitable information resp. divergence quantities (Theorem 1). However, they don't \single{letterize". Next we assume that X Y and W (xjx) > 0 for all x 2 X , and we associate with W the low noise channel W" , wher...
متن کاملA new lower bound on the maximal error probability for discrete memoryless multiple-access channels
In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) and thus results in a tighter sphere-packing exponent when compared to the tightest known...
متن کاملExponential error bounds on parameter modulation-estimation for discrete memoryless channels
We consider the problem of modulation and estimation of a random parameter U to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, E|Û−U |ρ, ρ ≥ 0, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be inti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1997
ISSN: 0018-9448
DOI: 10.1109/18.641560